State Focusing: Lazy Abstraction for the Mu-Calculus
نویسندگان
چکیده
A key technique for the verification of programs is counterexampleguided abstraction refinement (CEGAR). In a previous approach, we developed a CEGAR-based algorithm for the modal μ-calculus, where refinement applies only locally, i.e. lazy abstraction techniques are used. Unfortunately, our previous algorithm was not completely lazy and had some further drawbacks, like a possible local state explosion. In this paper, we present an improved algorithm that maintains all advantages of our previous algorithm but eliminates all its drawbacks. The improvements were only possible by changing the philosophy of refinement from state splitting into the new philosophy of state focusing, where the states that are about to be split are not removed.
منابع مشابه
Local Abstraction-Refinement for the mu-Calculus
Counterexample-guided abstraction refinement (CEGAR) is a key technique for the verification of computer programs. Grumberg et al. developed a CEGAR-based algorithm for the modal μ-calculus. There, every abstract state is split in a refinement step. In this paper, the work of Grumberg et al. is generalized by presenting a new CEGAR-based algorithm for the μ-calculus. It is based on a more expre...
متن کاملPredicate Abstraction with Block Abstraction Memoization ∗ ( Technical Report )
Predicate abstraction is an established technique for reducing the size of the state space during verification. In this paper, we extend predication abstraction with block abstraction memoization (ABM), which exploits the fact that blocks are often executed several times in a program. The verification can thus benefit from caching the values of previous block analysis’ and reusing them upon nex...
متن کاملThe Fusion Calculus: Expressiveness and Symmetry in Mobile Processes (extended Abstract)
We present the fusion calculus as a signiicant step towards a canonical calculus of concurrency. It sim-pliies and extends the-calculus. The fusion calculus contains the polyadic-calculus as a proper subcalculus and thus inherits all its expressive power. The gain is that fusion contains actions akin to updating a shared state, and a scoping construct for bounding their eeects. Therefore it is ...
متن کاملThe Fusion Calculus: Expressiveness and Symmetry in Mobile Processes
We present the fusion calculus as a signiicant step towards a canonical calculus of concurrency. It simpliies and extends the-calculus. The fusion calculus contains the polyadic-calculus as a proper subcalculus and thus inherits all its expressive power. The gain is that fusion contains actions akin to updating a shared state, and a scoping construct for bounding their eeects. Therefore it is e...
متن کاملGames and Full Abstraction for the Lazy -calculus
We deene a category of games G, and its extensional quotient E. A model of the lazy-calculus, a type-free functional language based on evaluation to weak head normal form, is given in G, yielding an extensional model in E. This model is shown to be fully abstract with respect to applicative simulation. This is, so far as we know, the rst purely semantic construction of a fully abstract model fo...
متن کامل